Interference in Branch Predictors: A Systematic Approach

نویسندگان

  • Veerle Desmet
  • Hans Vandierendonck
  • Koen De Bosschere
چکیده

As a result of resource limitations, state in branch predictors is frequently shared between uncorrelated branches. This interference can significantly limit prediction accuracy. In current predictor designs, the branches sharing prediction information are determined by their branch addresses and thus branch groups are arbitrarily chosen during compilation. This feasibility study explores a more analytic and systematic approach to classify branches into clusters with similar behavioral characteristics, and we evaluate several ways to incorporate this additional source of information in branch predictors. Our profile–based results illustrate the potential of using clustering information in various types of branch predictors. In particular for small predictor budgets, clustered indexing is a very cost effective solution, e.g. the misprediction rate in a 1 KiB gshare predictor is reduced by 19% and 12.3% for SPECint2000 in a self and cross profiling setup respectively.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Clustered indexing for branch predictors

As a result of resource limitations, state in branch predictors is frequently shared between uncorrelated branches. This interference can significantly limit prediction accuracy. In current predictor designs, the branches sharing prediction information are determined by their branch addresses and thus branch groups are arbitrarily chosen during compilation. This feasibility study explores a mor...

متن کامل

Using artificial neural networks to improve hardware branch predictors

Among the current techniques to predict the outcome of branches in modern microprocessors, two-level branch predictors have shown to be one of the best mechanisms. The correct prediction of branches is a fundamental factor for achieving high performance. Branch interference is a major contributor to the number of branches mispredicted by two-level predictors [4]. Increasing the size of the PHT ...

متن کامل

the 1996 Conference on Parallel Architectures and

Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works, must be obtained from the IEEE. Abstract Today's deeply pipelined, superscalar processors rely on accura...

متن کامل

Applying Caching to Two-Level Adaptive Branch Prediction

During the 1990s Two-level Adaptive Branch Predictors were developed to meet the requirement for accurate branch prediction in high-performance superscalar processors. However, while two-level adaptive predictors achieve very high prediction rates, they tend to be very costly. In particular, the size of the second level Pattern History Table (PHT) increases exponentially as a function of histor...

متن کامل

OPTS: increasing branch prediction accuracy under context switch

Accurate branch prediction is essential for obtaining high performance in pipelined superscalar processors. Though many dynamic branch predictors have been proposed to obtain high prediction accuracy, they cannot perform as expected under context switches. It is observed that context switches, even at fairly large intervals, can seriously degrade the performance of dynamic branch predictors. In...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005